breadth first search

Terms from Artificial Intelligence: humans at the heart of algorithms

Page numbers are for draft copy at present; they will be replaced with correct numbers when final book is formatted. Chapter numbers are correct and will not change now.

In breadth first search of a search tree, one prgresses by first of all looking at all of the nodes at level 1 (one step from the root), then all the nodes at level 2, etc.

Defined on page 63

Used on Chap. 4: pages 63, 65, 67, 68, 69, 70, 72, 74, 78, 80; Chap. 11: page 228; Chap. 15: page 347

Also known as breadth first, breadth first

Breadth first search -- order of visiting nodes